By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
Volume 6, Issue 1, pp. 1-180

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

On Error-Correcting Codes and Invariant Linear Forms

A. R. Calderbank and P. Delsarte

pp. 1-23

Algorithmic Aspects of Neighborhood Numbers

Gerard J. Chang, Martin Farber, and Zsolt Tuza

pp. 24-29

On the Structure of the Strong Orientations of a Graph

John Donald and John Elwin

pp. 30-43

Garden of Eden Configurations for Cellular Automata on Cayley Graphs of Groups

Antonio Machì and Filippo Mignosi

pp. 44-56

The Weighted Sparsity Problem: Complexity and Algorithms

S. Thomas McCormick and S. Frank Chang

pp. 57-69

Exact Formulas for Multitype Run Statistics in a Random Ordering

Macdonald Morris, Gabriel Schachtel, and Samuel Karlin

pp. 70-86

Characterization of the Homomorphic Preimages of Certain Oriented Cycles

Huishan Zhou

pp. 87-99

Matchings in the Partition Lattice

E. Rodney Canfield

pp. 100-109

Communication Complexity and Quasi Randomness

Fan R. K. Chung and Prasad Tetali

pp. 110-123

Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve

Daniel M. Gordon

pp. 124-138

Polyhedral Properties of Clutter Amalgam

P. Nobili and A. Sassano

pp. 139-151

Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of $S_n $

Frank Ruskey and Carla Savage

pp. 152-166

A New Triangulation for Simplicial Algorithms

Michael J. Todd and Levent Tunçel

pp. 167-180